A Theory of Agreements in Infinitely Repeated Games

نویسنده

  • Licun Xue
چکیده

In environments where players interact repeatedly, it is natural to assume that players can communicate and hence coordinate their actions. This paper offers a theory of self-enforcing agreements in infinitely repeated games as an alternative to the notion of renegotiation-proofness. The notion of stable (selfenforcing) agreements is defined and its central (distinct) feature is that in contemplating a deviation, a coalition does not, ex ante, count on renegotiating with nonmembers, even though renegotiation might occur ex post ; a coalition deviates only if by solely coordinating the actions of its own members, it can guarantee a higher payoff for each member; moreover, our theory allows every coalition to deviate. ∗ I am grateful to Professor Joseph Greenberg for many valuable suggestions, and to Professor Geir B. Asheim for helpful comments. Financial support from Social Sciences and Humanities Research Council of Canada (SSHRC) is gratefully acknowledged.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperation under the Shadow of the Future: Experimental Evidence from Infinitely Repeated Games

While there is an extensive literature on the theory of infinitely repeated games, empirical evidence on how “the shadow of the future” affects behavior is scarce and inconclusive. I simulate infinitely repeated prisoner’s dilemma games in the lab with a random continuation rule. The experimental design represents an improvement over the existing literature by including sessions with finite rep...

متن کامل

K-Memory Strategies in Repeated Games

In this paper, we study k-memory strategies in two-person repeated games. An agent adopting such a strategy makes his decision only based on the action profiles of the previous k rounds. We show that in finitely repeated games, the best response of a k-memory strategy may not even be a constant-memory strategy. However, in infinitely repeated games, one of the best responses against any given k...

متن کامل

14 . 12 Game Theory Lecture

In these notes, we’ll discuss the repeated games, the games where a particular smaller game is repeated; the small game is called the stage game. The stage game is repeated regardless of what has been played in the previous games. For our analysis, it is important whether the game is repeated finitely or infinitely many times, and whether the players observe what each player has played in each ...

متن کامل

Switching costs in infinitely repeated games

We show that small switching costs can have surprisingly dramatic effects in infinitely repeated games if these costs are large relative to payoffs in a single period. This shows that the results in Lipman and Wang do have analogs in the case of infinitely repeated games [Lipman, B., Wang, R., 2000. Switching costs in frequently repeated games. J. Econ. Theory 93, August 2000, 149–190]. We also...

متن کامل

Long–term Equilibria of Repeated Consistently Competitive Games

The class of consistently competitive games canonically unifies Prisoner’s Dilemmas, contests, auctions, and Bertrand competitions. If those games are repeated infinitely, the players have to negotiate about the strategies that are to be repeated infinitely. These negotiations, however, are perturbed by the possibility that players make defective proposals (defective proposals are sensibly not ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997